Method intended for gradual, deformation of a boolean model simulating a heterogeneous medium, constrained to dynamic data

ABSTRACT

Method intended for gradual deformation of a Boolean model allowing to best simulate the spatial configuration, in a heterogeneous underground zone, of geologic objects defined by physical quantities. The model is optimized by means of an iterative optimization process from realizations including each objects whose number is a random Poisson variable of determined mean, and by minimizing an objective function. In order to impose a continuity in the evolution of said objects in size, number, positions, within the model, a combined realization obtained by combining on the one hand an initial realization comprising a certain number of objects corresponding to a first mean value and at least another independent realization having another number of objects corresponding to a second mean value is constructed, this combination being such that the resulting number of objects has a mean value equal to the sum of the first and of the second mean value and that this mean value is also that defined by the model. Furthermore, the size of the objects is associated with the procedure for generating the number of objects so as to make an object appear or disappear progressively. Application: construction of a Boolean underground reservoir model allowing to simulate the configuration of various heterogeneities: fractures, channels, etc.

FIELD OF THE INVENTION

The present invention relates to a method intended for gradual deformation of a Boolean model simulating a heterogeneous medium, constrained to dynamic data.

The method according to the invention notably applies to the construction of a model for representing the spatial distribution, in an underground zone, of some physical properties of the medium such as the permeability, the porosity, etc.

BACKGROUND OF THE INVENTION

The following documents mentioned in the description hereafter illustrate the state of the art:

-   -   Chilès, J. P., and Delfiner, P., 1999, Geostatistics : Modeling         spatial uncertainty, Wiley, New York, 695p.,     -   Hu, L. -Y., 2000a, Gradual deformation and iterative calibration         of Gaussian-related stochastic models, Math. Geol., 32(1),     -   Hu, L. -Y., 2000b, Gradual deformation of non-Gaussian         stochastic models, Geostats 2000 Cape Town, W J Kleingeld and D         G Krige (eds.), 1, 94-103,     -   Hu, L. -Y., 2003, History matching of object-based stochastic         reservoir models, SPE 81503,     -   Journel, A., and Huijbregts, C. J., 1978, Mining Geostatistics,         Academic Press, London, 600p.,     -   Le Ravalec, M., Noetinger, B., and Hu, L. -Y., 2000, The FFT         moving average (FFT-MA) generator: an efficient numerical method         for generating and conditioning Gaussian simulations, Math.         Geol., 32(6), 701-723,     -   Le Ravalec, M., Hu, L. -Y., and Noetinger, B., 2001, Stochastic         reservoir modeling constrained to dynamic data: local         calibration and inference of the structural parameters, SPE         Journal, 25-31.

Various methods based on a gradual deformation scheme form the object of the following patents or patent applications by the claimant: FR-2,780,798, FR-2,795,841, FR-2,821,946, FR-02/13,632 or FR-03/02,199.

Realizations of Gaussian or Gaussian-related stochastic models are often used to represent the spatial distribution of certain physical properties, such as permeability or porosity, in underground reservoirs. Inverse methods are then commonly used to constrain these realizations to data on which they depend in a non-linear manner. This is notably the case in hydrology or in the petroleum industry. These methods are based on minimization of an objective function, also referred to as cost function, which measures the difference between the data measured in the field and the corresponding responses numerically simulated for realizations representing the medium to be characterized. The aim is to identify the realizations associated with the lowest objective function values, i.e. the most coherent realizations as regards the data.

The gradual deformation method was introduced in this context (see Hu, 2000a; Le Ravalec et al., 2000). This geostatistical parameterization technique allows to gradually modify the realizations from a limited number of parameters. It is particularly well-suited to minimization problems because, when applied to realizations, it induces a continuous and regular variation of the objective function. In fact, minimization can be performed from the most advanced techniques, i.e. gradient techniques. The gradual deformation method has proved efficient for constraining oil reservoir models to production data (see Le Ravalec et al., 2001).

The gradual deformation method initially set up for Gaussian models has afterwards been extended to non-Gaussian models (see Hu, 2000b) and more particularly to object or Boolean models. These models are used to describe media comprising for example channels or fractures. The channels or fractures are then considered as objects. An algorithm has been proposed to simulate the gradual migration of objects in space, i.e. the gradual displacement of objects in space. For a realization of an object model, this type of perturbation translates into a smoothed variation of the objective function, as for Gaussian models. This algorithm has then been generalized to the non-stationary and conditional Boolean model (see Hu, 2003). Besides, still using the gradual deformation of Gaussian laws, solutions allowing to progressively modify the number of objects that populate a model are proposed (see Hu, 2003), this number being representative of a Poisson's law. However, one limit of these developments is that the objects appear or disappear suddenly, which can generate severe discontinuities of the objective function and make the gradient techniques conventionally used for carrying out the minimization process difficult to implement.

Gradual Deformation: Reminders

Multi-Gaussian Random Function

The gradual deformation principles that have been proposed to date apply to multi-Gaussian random functions. Let there be, for example, two independent random functions Y₁(x) and Y₂(x), multi-Gaussian and stationary of order 2. x is the position vector. These two functions are assumed to have the same means and variances, i.e. 0 and 1, and the same covariance function. A new random function Y(t) is then constructed by combining Y₁ and Y₂ according to the expression as follows: Y(t)=Y ₁ cos(t)+Y ₂ sin(t).

It can be shown that, whatever t, Y has the same mean, variance and covariance model as Y₁ and Y₂. Besides, Y(t) is also a multi-Gaussian random function because it is the sum of two multi-Gaussian random functions.

According to this combination principle, a chain of realizations y(t) depending only on deformation parameter t can be constructed from two independent realizations y₁ and y₂ of Y₁ and Y₂. The basic idea of minimization processes using gradual deformation is to explore this chain of realizations and to determine the deformation parameter providing the realization which is the most compatible with the data measured in the field, i.e. the pressures, production rates, breakthrough times, etc. Since exploration of a single chain of realizations does generally not allow to identify a realization providing a sufficiently small objective function, the seek process is iterated. The optimum realization determined for the 1^(st) chain is then combined with a new independent realization of Y₂, and a new chain of realizations whose exploration can provide a realization which reduces the objective function even further is deduced therefrom, etc.

Poisson Point Process

The key element of Boolean models is a Poisson point process which characterizes the spatial layout of the objects. Let us consider a base Boolean model for which the objects have the same shape and are randomly and uniformly distributed in space. The positions of these objects are distributed according to the Poisson point process of constant density. In other words, the position of an object in space with n dimensions [0,1]^(n) is defined by vector x whose n components are uniform numbers drawn independently according to the uniform distribution law between 0 and 1.

The objects migration technique (see Hu, 2000b) consists in gradually deforming the position of the objects. The position of an object is determined by uniform numbers. First and foremost, these uniform numbers are converted to Gaussian numbers: Y=G ⁻¹(x).

G is the standard normal distribution function. Let x₁ be the initial position of a given object and x₂ another possible position, independent of x₁. A trajectory is defined for the object by combining the Gaussian transforms of these two positions according to the gradual deformation method: x(t)=G|G ⁻¹(x ₁)cos(t)+G ⁻¹(x ₂)sin(t)|

It can be shown that, for any value of deformation parameter t, x is a uniform point of [0,1]^(n). When the two positions x₁ and x₂ are fixed, the trajectory is completely determined. A two-dimensional example is shown in FIG. 1.

The object migration technique is a first move towards the gradual deformation of Boolean simulations. One of its limits is that the number of objects is assumed to be constant during deformation. Solutions have been proposed to progressively modify the number of objects that populate a model (see patent N-01/03,194 or Hu, 2003 mentioned above). However, one limit of these developments is that the objects appear or disappear suddenly, which can generate severe discontinuities of the objective function. The gradual deformation method according to the invention allows, as described below, to reduce this discontinuity and thus to facilitate the implementation of gradient-based optimization techniques.

SUMMARY OF THE INVENTION

The method according to the invention allows to gradually deform a Boolean model allowing to best simulate the spatial configuration, in a heterogeneous underground zone, of geologic objects defined by physical quantities, that is constrained to measured dynamic data representative of fluid displacements in the medium, and by imposing a continuity in the evolution of said objects. It comprises carrying out an iterative optimization process from realizations including each at least one of the objects whose number is drawn from a Poisson random variable of determined mean, and minimization of an objective function measuring the difference between real dynamic data and the dynamic data simulated by means of a flow simulator from a combined realization, by adjustment of combination coefficients, the iterative adjustment process being continued until an optimum realization of the stochastic model is obtained.

The method is characterized in that, upon each iteration:

-   -   a combined realization obtained by combination, on the one hand,         of an initial realization consisting of N1(t) objects         corresponding to a first mean value and of at least a second         independent realization of the same model consisting of N2(t)         objects corresponding to a second mean value is constructed,         this combination being such that the number N(t) of objects of         the combination has a mean value equal to the sum of the first         and of the second mean value.

According to an implementation mode, upon each iteration and for the same mean value of the combination, the first and the second mean value are varied concomitantly so as to gradually vary the number and the size of objects from each one of the combined realizations.

In other words, the proposed method allows to gradually modify the number of objects that populate a Boolean model and, notably, to consider a new Boolean model construction technique with, now, progressive appearance and disappearance of the objects.

This new possibility allows to attenuate the discontinuities of the objective function in an inversion procedure and consequently to facilitate setting up of the gradient-based optimization algorithms.

The proposed gradual deformation scheme applied to the Poisson random variables makes gradual deformation of the number of objects that populate Boolean simulations possible. Furthermore, we propose to associate the size of the objects with the Poisson process used to generate the number of objects of a Boolean simulation, which leads us to an algorithm allowing to make an object progressively appear or disappear during deformation of a Boolean realization. The possible discontinuities of the objective function are thus reduced. These algorithms are easy to implement and can be combined with an optimization algorithm to calibrate Boolean type reservoir models with production data, pressure, breakthrough time, etc.

Unlike the Gaussian type reservoir model, the discontinuity of an objective function is intrinsic in the object type reservoir model. In some cases, displacement of an object by a single grid cell can cause a sudden change in the connexity of the model and, consequently, a radical change in the hydrodynamic behaviour of the model. By making an object progressively appear or disappear in a Boolean simulation, we do not eliminate, but attenuate this discontinuity. We therefore facilitate the implementation of gradient-based optimization algorithms.

BRIEF DESCRIPTION OF THE FIGURES

Other features and advantages of the method and of the device according to the invention will be clear from reading the description hereafter of a non limitative embodiment example, with reference to the accompanying drawings wherein:

FIG. 1 shows an example of trajectory defined from two points in [0,1]²,

FIG. 2 shows a simulation of a realization n for a Poisson variable of parameter λ,

FIG. 3 shows an example of gradual deformation of a Poisson variable of mean λ by combining two independent Poisson variables N₁ and N₂,

FIG. 4 shows an example of gradual deformation of a Poisson realization for a variable of parameter 10,

FIG. 5 shows an example of gradual deformation of the number and of the position of the objects with progressive appearance and disappearance. The small grey ellipse disappears and a black ellipse appears,

FIG. 6 shows an example of reference model in the centre, injection well bottomhole pressure on the left and producing well fractional flow on the right,

FIG. 7 shows an example of reservoir invasion by the water injected,

FIG. 8 shows the evolution of the objective function when the deformation parameter describes a chain,

FIG. 9 shows an example of gradual deformation of the number and of the position of the objects with sudden appearance and disappearance; this chain corresponds to the four points circled in FIG. 8, and

FIG. 10 shows another example of gradual deformation of the number and of the position of the objects with progressive appearance and disappearance; it is the same chain as in FIG. 9.

DETAILED DESCRIPTION

Gradual Deformation of the Number of Objects

The objects migration technique is a first move towards gradual deformation of Boolean simulations. One of its limits is that the number of objects is assumed to be constant during deformation. Solutions are proposed to progressively modify the number of objects that populate a model (see Patent N-01/03,194 or Hu, 2003 mentioned above). However, one limit of these developments is that the objects appear or disappear suddenly, which can generate severe discontinuities of the objective function. The gradual deformation method according to the invention allows, as described below, to reduce this discontinuity and thus to facilitate the implementation of gradient-based optimization techniques.

Poisson's Law

Our objective is to gradually deform the number of objects for a Boolean simulation. This number is a random number and follows a Poisson's law, i.e. the probability for this (non-negative) number to be n is: ${P\left( {N = n} \right)} = {{\exp\left( {- \lambda} \right)}\frac{\lambda^{n}}{n!}}$ where λ is the mean and the variance of the Poisson variable N.

A possible technique for simulating a Poisson variable is to generate a Poisson process of mean 1 over a period equal to λ, since the number of events occurring during this period follows a Poisson's law of parameter λ. Independent intervals OE₁, E₁E₂, . . . E_(n) E_(n+1) (FIG. 2) are therefore successively generated according to an exponential law of mean equal to 1 (law γ₁), and their values are added until λ is exceeded. The distribution function of a variable X according to the exponential law of mean 1 is expressed as follows: F(x)=1−exp(−x).

If r is a random number uniformly distributed between 0 and 1, 1−r is also uniformly distributed over [0;1]. We then put 1−r=1−exp(−x). In fact, simulation of the successive segments just requires repeating x=−Log(r) for different r. The realization n of the Poisson variable N is then the highest integer n such that: ${\sum\limits_{i = 1}^{n}\quad{- {{Log}\left( r_{i} \right)}}} < \lambda$ or, which is equivalent, but more economical as regards calculation: ${\prod\limits_{i = 1}^{n}\quad r_{i}} > {{\exp\left( {- \lambda} \right)}.}$

On the other hand, this second formulation is undoubtedly more numerically unstable when λ is high.

Gradual Deformation of Poisson Variables

The gradual deformation principles presented above apply to Gaussian numbers that vary continuously in

. The Poisson variables being integers, these principles do not apply as things are.

It can be reminded that the sum of two independent Poisson variables of parameter λ for one and μ for the other still is a Poisson variable, but of parameter λ+μ. This fundamental result lies at the root of the gradual deformation algorithm we propose. Let N₁ and N₂ be two independent Poisson variables of parameter λ (see FIG. 3). We propose to gradually deform the parameters of these two added variables, but while respecting at any time the fact that the sum of the parameters is λ. To prevent any confusion between the parameter of the Poisson variables and the deformation parameter, we will respectively refer to mean and deformation parameter. We thus construct a new Poisson variable N(t) of mean λ from: N(t){λ}=N ₁ {a ₁(t)λ}+N ₂ {a ₂(t)λ} with ${\sum\limits_{i = 1}^{2}\quad a_{i}} = {1.\quad{a_{i}(t)}\lambda}$ is the mean of variable N_(i) at the time of the combination (see FIG. 3). We select for example a₁=cos²(t) and a₂=sin²(t). This parameterization is readily extended to n dimensions: ${{{N(t)}\left\{ \lambda \right\}} = {{\sum\limits_{i = 1}^{n}\quad{N_{i}\left\{ {{a_{i}(t)}\lambda} \right\}\quad{with}\quad{\sum\limits_{i = 1}^{n}\quad a_{i}}}} = 1}},$ and affords the advantage of being periodic.

Trigonometric functions can for example be selected for coefficients a_(i).

By varying deformation parameter t, the mean of the added variables is modified, which affects the realizations of these variables. Their sum thus also changes. By following this deformation principle, a chain of realizations n(t) depending only on deformation parameter t can be constructed from two realizations n1 and n2 of N₁ and N₂. When t is equal to 0, the realization of N is n₁; when t is equal to ${\pm \frac{\pi}{2}},$ the realization of N is n₂. It can be shown that N(t) is periodic of period π. FIG. 4 illustrates this deformation principle for a Poisson variable of mean 10. When the deformation parameter divided by π is 0, the realization is the same as the realization initially considered (n₁=12). When it is ±0.5, the realization is the same as the second realization considered for combination (n₂=9). Another approach could be considered for gradually deforming a Poisson variable of parameter λ. It would consist in displacing a segment of length λ on a line constructed from the addition of an infinity of segments of lengths obtained by means of a law γ₁. The number of complete segments fitting into the segment of length λ would be a realization of the Poisson variable and would vary with the position of this segment.

Successive Construction of Deformation Chains

In the case of Gaussian realizations, the gradual deformation method is naturally integrated in the minimization processes. This is translated into a successive exploration of Gaussian realization chains constructed from an initial realization which corresponds to the optimum determined for the previous chain and from a second Gaussian realization randomly generated for each chain.

For the Poisson numbers, a similar procedure is followed. Gradual deformation, according to the principles specified in the previous section, of two realizations of a Poisson's law, one referred to as initial and the second as complementary, provides a first chain. Exploration of this chain leads to the identification of an “optimum” realization which minimizes the objective function. This realization is then used as an initial realization for creating a new chain. This new chain also requires a new complementary realization, generated independently. Again, exploration of this new chain can allow to reduce the objective function further. This seek process is iterated until the objective function is considered to be sufficiently small.

Progressive Appearance and Disappearance of an Object

The gradual deformation principle proposed above allows to perturb, during an optimization, the number of objects that populate a Boolean simulation. Clearly, the sudden appearance or disappearance of objects is likely to induce a sudden variation of the objective function. Now, optimizations based on gradient calculations require a continuous evolution of the objective function. We therefore propose a new type of Boolean models providing progressive appearance and disappearance of objects.

Principle

Let us go back to the generation of a Poisson number n from a Poisson process. The method reminded above (see FIG. 2) consists in placing segments end to end until a length exceeding parameter λ of the Poisson variable is obtained. n is the integer such that OE_(n)<λ and OE_(n+1)>λ.

Let us denote the point such that the length of segment OL₁ is equal to the mean of the Poisson variable by L₁ (see FIG. 3). During the deformation process, this point moves. At t=0, for variable N₁, OL₁=λ. Segment OL, then comprises n₁ complete segments (OE₁, E₁E₂, . . . E_(n1−1)E_(n1)) and a (n₁+1)^(th) truncated segment (E_(n1)L₁). We deduce therefrom that the Boolean simulation is populated with n₁+1 objects of determined size, surface or volume from the anamorphosed lengths of segments OE₁, E₁E₂, . . . E_(n1)L₁. For simplification reasons, we will use the term size of objects in the description below. If we increase deformation parameter t, segment OL₁ is reduced; it is the same for E_(n1)L₁. Consequently, the size of the (n₁+1)^(th) object decreases: the object disappears progressively. If the mean of variable N₁ continues to decrease, the n₁ ^(th) object also starts to reduce, etc. At the same time, the mean of variable N₂ increases. The realization for this variable is first 0, then a first object progressively appears. Its size is controlled by the length of segment PL₂, where point L₂ is for N₂ the equivalent of L₁ for N₁. When PL₂=PI₁, the first object is complete. If the mean of N₂ continues to increase, a second object appears. Its size now depends on the length of segment I₁L₂.

FIG. 5 illustrates the proposed method. Two families of objects, black ellipses and grey ellipses, can be seen. The colour difference lies in the fact that the objects considered are obtained from two Poisson variables, N₁ and N₂. The position of the ellipses varies gradually; the ellipses appear and disappear progressively. Image 1 shows 4 grey ellipses, 3 large ones (two are more or less superposed) and a small one; the latter is appearing. A black ellipse and a black point, which indicates the appearance of a new black ellipse, can also be observed. In images 2 to 5, the small grey ellipse becomes increasingly small until it is reduced to a point. At the same time, the small black ellipse increases. In image 6, the small grey ellipse has totally disappeared. Another grey ellipse now starts to reduce. The small black ellipse becomes slightly larger.

As above, the same type of gradual deformation could be simulated by moving a segment of length λ on a line constructed from the addition of an infinity of segments of lengths obtained by means of a law γ₁. This segment of length λ would comprise complete segments in the centre and, at the ends thereof, a segment that would tend to increase and another one that would exhibit the opposite behaviour.

Impact on the Objective Function

By way of example, we consider a synthetic reservoir model in FIG. 6. It consists of a reservoir rock of permeability 500 mD and of low-permeability lenses of permeability 50 mD. The lenses are shown by ellipses. For simplification reasons, the porosity is assumed to be constant and equal to 30% everywhere. The model is discretized on a 200×200-cell grid, of length 1 m along the X-axis and 0.8 m along the Y-axis. For this initially oil-saturated reservoir, the following test is carried out by means of the 3DSL flow simulator. Water is injected at 100 m³/day for 100 days in well I and oil is produced at constant pressure in well P. The injection well bottomhole pressure and the producing well fractional water flow are shown in FIG. 6. These data are referred to as reference data because they relate to the reference model. The water invasion is illustrated in FIG. 7 for different times. The lenses initially form a flow barrier, then they gradually become water-saturated.

We then assume that we know nothing about the position and the number of the lenses. Knowing only the injection well pressure response and the producing well water response, we try to identify a reservoir model as coherent as possible with these data. We assume that information from geology for example allows to approximate the number of lenses from a Poisson's law of parameter 10. By applying the gradual deformation processes proposed above, we construct a chain of Boolean simulations characterized by the gradual variation of the number of ellipses and their position. The gradual deformation of the size of the ellipses could also be considered. For all these simulations, the injection test is simulated numerically and an objective function measuring the difference between the reference data and the simulated data (FIG. 8) is deduced therefrom. Deformation parameter t controls both the deformation of the number of ellipses and their position. The gradual deformation relations are such that a complete period is explored with t ranging between −π/2 and +π/2. Two cases are examined. The ellipses appear and disappear suddenly for the first one, and progressively for the second. In the first case, the objective function sometimes evolves with jumps. We check that the jumps are absent or at least greatly attenuated in the second case. The variation of the number of objects as a function of the deformation parameter throughout the chain is described in FIG. 4: this number is the one that is obtained for sudden ellipse appearances and disappearances.

In FIG. 8, for the curve in thick line, the number of objects varies with progressive appearance and disappearance of the objects. For the diamonds, the number of objects varies with sudden appearance and disappearance of the objects—it is specified by FIG. 4. Let us concentrate on the 4 realizations whose objective function values are circled in FIG. 8. This is precisely a case where the objective function exhibits a discontinuous behaviour when the ellipses appear and disappear suddenly. On the contrary, the evolution is continuous for progressive appearances and disappearances. The realizations in question are shown in FIG. 9 and FIG. 10. In FIG. 9 2), the sudden disappearance of an ellipse significantly enlarges the flow path from the injection well to the producing well. This realization is furthermore the one which, of the whole chain, provides the smallest objective function. This is not the case in FIG. 10 2), even though the size of the ellipse concerned has decreased. The latter continues to reduce in FIG. 10 3). In FIG. 10 4), it becomes so small that its effect is negligible and scenarios 9-4 and 10-4 are finally equivalent.

Successive Construction of Deformation Chains

As explained above at the end of section 2, it is possible, during a minimization process, to explore successively several chains, knowing that the initial realization for a chain is the optimum realization identified for the previous chain. The only difference in relation to what has been said in section 3 is that the truncated segments are also integrated in the construction of the segment of length λ. 

1-5. (cancelled)
 6. A method for deforming a Boolean model allowing a best simulation of a spatial configuration, in a heterogeneous underground zone, of geologic objects defined by physical quantities, that is constrained to measured dynamic data representative of fluid displacements in the underground zone, by imposing a continuity in evolution of the objects comprising: carrying out an iterative optimization process from realizations each including at least one of the geologic objects whose number is drawn from a Poisson random variable of determined mean and minimizing an objective function measuring a difference between the measured dynamic data and simulated dynamic data simulated by means of a flow simulator from a combined realization by adjustment of combination coefficients; and continuing the iterative optimization adjustment process until an optimum realization of the stochastic model is obtained, wherein upon each iteration a combined realization is obtained by combination, of an initial realization of N1(t) objects corresponding to a first mean value and of at least a second independent realization of a same model of N2(t) objects corresponding to a second mean value; and wherein the combination is such that a number N(t) of objects of the combination has a mean value equal to a sum of the first and of the second mean value.
 7. A method as claimed in claim 6, wherein: upon each iteration, for a same mean value of the combination, the first and the second mean values are varied together to vary a number of objects from each combined realization.
 8. A method as claimed in claim 6, wherein: a size of the objects is associated with a procedure for generating the number of objects so as to make an object appear or disappear progressively.
 9. A method as claimed in claim 7, wherein: a size of the objects is associated with a procedure for generating the number of objects so as to make an object appear or disappear progressively.
 10. A method as claimed in claim 6, wherein: the number N(t) of objects of the combination of a mean λ is related to the respective numbers of objects Ni (i=1 . . . n) of the combined relations by a relation: ${{{N(t)}\left\{ \lambda \right\}} = {{\sum\limits_{i = 1}^{n}\quad{N_{i}\left\{ {{a_{i}(t)}\lambda} \right\}\quad{with}\quad{\sum\limits_{i = 1}^{n}\quad a_{i}}}} = 1}},$ and a_(i) (t)λ is a mean of variable N_(i) at a time of the combination.
 11. A method as claimed in claim 7, wherein: the number N(t) of objects of the combination of a mean λ is related to the respective numbers of objects Ni (i=1 . . . n) of the combined relations by a relation: ${{{N(t)}\left\{ \lambda \right\}} = {{\sum\limits_{i = 1}^{n}\quad{N_{i}\left\{ {{a_{i}(t)}\lambda} \right\}\quad{with}\quad{\sum\limits_{i = 1}^{n}\quad a_{i}}}} = 1}},$ and a_(i) (t)λ is a mean of variable N_(i) at a time of the combination.
 12. A method as claimed in claim 10, wherein for a combination involving only two realizations, trigonometric functions are selected for coefficients a₁, a₂.
 13. A method as claimed in claim 11, wherein for a combination involving only two realizations, trigonometric functions are selected for coefficients a₁, a₂.
 14. A method in according with claim 12 wherein: the selected trigametric functions for coefficients a₁ and a₂ are a₁=cos²(t) and a²=sin²(t).
 15. A method in according with claim 13 wherein: the selected trigametric functions for coefficients a₁ and a₂ are a₁=cos²(t) and a²=sin²(t). 